The Most Inaccessible Point of a Convex Domain
نویسندگان
چکیده
The inaccessibility of a point p in a bounded domain D ⊂ R is the minimum of the lengths of segments through p with boundary at ∂D. The points of maximum inaccessibility ID are those where the inaccessibility achieves its maximum. We prove that for strictly convex domains, ID is either a point or a segment, and that for a planar polygon ID is in general a point. We study the case of a triangle, showing that this point is not any of the classical notable points.
منابع مشابه
Weighted composition operators between growth spaces on circular and strictly convex domain
Let $Omega_X$ be a bounded, circular and strictly convex domain of a Banach space $X$ and $mathcal{H}(Omega_X)$ denote the space of all holomorphic functions defined on $Omega_X$. The growth space $mathcal{A}^omega(Omega_X)$ is the space of all $finmathcal{H}(Omega_X)$ for which $$|f(x)|leqslant C omega(r_{Omega_X}(x)),quad xin Omega_X,$$ for some constant $C>0$, whenever $r_{Omega_X}$ is the M...
متن کاملCategory and subcategories of (L,M)-fuzzy convex spaces
Inthispaper, (L,M)-fuzzy domain finiteness and (L,M)-fuzzy restricted hull spaces are introduced, and several characterizations of the category (L,M)-CS of (L,M)-fuzzy convex spaces are obtained. Then, (L,M)-fuzzy stratified (resp. weakly induced, induced) convex spaces are introduced. It is proved that both categories, the category (L,M)-SCS of (L,M)-fuzzy stratified convex spaces and the cate...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملExistence Results of best Proximity Pairs for a Certain Class of Noncyclic Mappings in Nonreflexive Banach Spaces Polynomials
Introduction Let be a nonempty subset of a normed linear space . A self-mapping is said to be nonexpansive provided that for all . In 1965, Browder showed that every nonexpansive self-mapping defined on a nonempty, bounded, closed and convex subset of a uniformly convex Banach space , has a fixed point. In the same year, Kirk generalized this existence result by using a geometric notion of ...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کامل